Exponential Least Squares Solvers for Linear Equations Over Networks
نویسندگان
چکیده
We study the approach to obtaining least squares solutions to systems of linear algebraic equations over networks by using distributed algorithms. Each node has access to one of the linear equations and holds a dynamic state. The aim for the node states is to reach a consensus as a least squares solution of the linear equations by exchanging their states with neighbors over an underlying interaction graph. A continuous-time distributed least squares solver over networks is developed in the form of the famous Arrow-Hurwicz-Uzawa flow. A necessary and sufficient condition is established for the graph Laplacian, regarding whether the continuous-time distributed algorithm can give the least squares solution. The feasibility of different fundamental graphs is discussed including path graph, star graph, etc. Moreover, a discrete-time distributed algorithm is developed by Euler’s method, converging exponentially to the least squares solution at the node states with suitable step size and graph conditions. The convergence rate is exponential for both the continuous-time and discrete-time algorithms under the established conditions.
منابع مشابه
An Arrow-Hurwicz-Uzawa Type Flow as Least Squares Solver for Network Linear Equations
We study the approach to obtaining least squares solutions to systems of linear algebraic equations over networks by using distributed algorithms. Each node has access to one of the linear equations and holds a dynamic state. The aim for the node states is to reach a consensus as a least squares solution of the linear equations by exchanging their states with neighbors over an underlying intera...
متن کاملEngineering Application Of Correlation on Ann Estimated Mass
A functional relationship between two variables, applied mass to a weighing platform and estimated mass using Multi-Layer Perceptron Artificial Neural Networks is approximated by a linear function. Linear relationships and correlation rates are obtained which quantitatively verify that the Artificial Neural Network model is functioning satisfactorily. Estimated mass is achieved through recallin...
متن کاملBDDC Preconditioning for High-Order Galerkin Least Squares Methods using Inexact Solvers
A high-order Galerkin Least-Squares (GLS) finite element discretization is combined with a Balancing Domain Decomposition by Constraints (BDDC) preconditioner and inexact local solvers to provide an efficient solution technique for large-scale, convection-dominated problems. The algorithm is applied to the linear system arising from the discretization of the two-dimensional advection-diffusion ...
متن کاملUtilities Init Routine Parameter Setup Optimization Driver NLPLIB Solver OPTIM
The paper presents a Graphical User Interface (GUI) for nonlinear programming in Matlab. The GUI gives easy access to all features in the NLPLIB TB (NonLinear Programming LIBrary Toolbox); a set of Matlab solvers, test problems, graphical and computational utilities for unconstrained and constrained optimization, quadratic programming, unconstrained and constrained nonlinear least squares, box-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017